On irredundant sets of postulates
نویسندگان
چکیده
منابع مشابه
Irredundant Sets in Boolean Algebras
It is shown that every uncountable Boolean algebra A contains an uncountable subset / such that no a of / is in the subalgebra generated by I\{a} using an additional axiom of set theory. It is also shown that a use of some such axiom is necessary. A subset / of a Boolean algebra A is irredundant if no proper subset of / generates the same subalgebra as /, or equivalently, if no a of / is in the...
متن کاملIrredundant Generating Sets of Finite Nilpotent Groups
It is a standard fact of linear algebra that all bases of a vector space have the same cardinality, namely the dimension of the vector space over its base field. If we treat a vector space as an additive abelian group, then this is equivalent to saying that an irredundant generating set for a vector space must have cardinality equal to the dimension of the vector space. The same is not true for...
متن کاملAGM postulates in Answer Sets
Revising and updating beliefs and knowledge bases is an important topic in knowledge representation and reasoning that requires a solid theoretical basis. As a result, various researchers have proposed Answer Set Programming as one of their key components to set up their approaches. In the need to satisfy more general principles, this paper presents a new characterisation of a semantics. It con...
متن کاملThe complexity of irredundant sets parameterized by size
An irredundant set of vertices V ′ ⊆ V in a graph G = (V,E) has the property that for every vertex u ∈ V ′, N(V ′ − {u}) is a proper subset of N(V ′). We investigate the parameterized complexity of determining whether a graph has an irredundant set of size k, where k is the parameter. The interest of this problem is that while most “k-element vertex set” problems are NP-complete, several are kn...
متن کاملGroups With Maximal Irredundant Covers And Minimal Blocking Sets
Let n be a positive integer. Denote by PG(n, q) the n-dimensional projective space over the finite field Fq of order q. A blocking set in PG(n, q) is a set of points that has non-empty intersection with every hyperplane of PG(n, q). A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if PG(ni, q) contains a minimal blocking set of size ki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1926
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1926-04175-6